Exponent of Periodicity of Word Equations in Fixed Dimension is Polynomial
نویسنده
چکیده
The exponent of periodicity is a key parameter used in all currently known algorithms for solving word equations. A lower bound for it is 2c|E|, where |E| is the length of the equation E. We prove that in fixed dimension, i.e., when the variables belong to a fixed set V , the exponent of periodicity can be bound by a polynomial p(|E|) of degree no more than thrice the size of the set V .
منابع مشابه
Periodicity in a System of Differential Equations with Finite Delay
The existence and uniqueness of a periodic solution of the system of differential equations d dt x(t) = A(t)x(t − ) are proved. In particular the Krasnoselskii’s fixed point theorem and the contraction mapping principle are used in the analysis. In addition, the notion of fundamental matrix solution coupled with Floquet theory is also employed.
متن کاملWord Equations with Two Variables
The problem whether the set of all equations that are satisfiable in some free semigroup or, equivalently, in an algebra of words with concatenation is recursive (usually called the satisfiability problem for semigroup equations) was first formulated by A.A. Markov in early sixties (see [3]). Special cases of the problem were solved affirmatively by A.A. Markov (see [3]), Yu.I. Khmelevskiı̆ [8],...
متن کاملComplexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a word equation is at most 2, where n is the length of the equation. Since the best known lower bound is 2 our upper bound is almost optimal and exponentially better than the original bound (6n) 2n4 + 2. Thus our result ...
متن کاملEquations in free semigroups with involution and their relation to equations in free groups
A free semigroup with involution (FSI) is essentially the set of words over a given alphabet plus an operator which reverses words. The paper introduces equations in FSI and show that they are the right objects to deal with when studying the complexity of equations in free groups. On these lines, we generalize to FSI several results valid for word equations, like the overlapping lemma, the 2O(|...
متن کاملStudying Transition Behavior of Neutron Point Kinetics Equations Using the Lyapunov Exponent Method
The neutron density is one of the most important dynamical parameters in a reactor. It is directly related to the control and stability of the reactor power. Any change in applied reactivity and some of dynamical parameters in the reactor causes a change in the neutron density. Lyapunov exponent method is a powerful tool for investigating the range of stability and the transient behavior of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 12 شماره
صفحات -
تاریخ انتشار 2002